Asynchronous sliding block maps

We deene a notion of asynchronous sliding block map that can be realized by transducers labeled in A B. We show that, under some conditions, it is possible to synchronize this transducer by state splitting, in order to get a transducer which deenes the same sliding block map and which is labeled in A B k , where k is a constant integer. In the case of a transducer with a strongly connected graph, the synchronization process can be considered as an implementation of an algorithm of C. Frougny and J. Sakarovitch of synchronization of rational relations of bounded delay. The algorithm can be applied in the case where the transducer has a constant integer transmission rate on cycles and has a strongly connected graph. It keeps the locality of the input automaton of the transducer. We show that the size of the sliding window of the synchronous local map grows linearly during the process, but that the size of the transducer is intrinsically exponential. In the case of non strongly connected graphs, the algorithm of C. Frougny and J. Sakarovitch does not keep the locality of the input automaton of the transducer. We give another algorithm to solve this case without losing the good dynamic properties that guarantees the state splitting process.